Robust Non-Rigid Point Set Registration Using Student's-t Mixture Model
نویسندگان
چکیده
منابع مشابه
Robust Non-Rigid Point Set Registration Using Student's-t Mixture Model
The Student's-t mixture model, which is heavily tailed and more robust than the Gaussian mixture model, has recently received great attention on image processing. In this paper, we propose a robust non-rigid point set registration algorithm using the Student's-t mixture model. Specifically, first, we consider the alignment of two point sets as a probability density estimation problem and treat ...
متن کاملNon-rigid point set registration: Coherent Point Drift
We introduce Coherent Point Drift (CPD), a novel probabilistic method for nonrigid registration of point sets. The registration is treated as a Maximum Likelihood (ML) estimation problem with motion coherence constraint over the velocity field such that one point set moves coherently to align with the second set. We formulate the motion coherence constraint and derive a solution of regularized ...
متن کاملInverse consistent non-rigid image registration based on robust point set matching
BACKGROUND Robust point matching (RPM) has been extensively used in non-rigid registration of images to robustly register two sets of image points. However, except for the location at control points, RPM cannot estimate the consistent correspondence between two images because RPM is a unidirectional image matching approach. Therefore, it is an important issue to make an improvement in image reg...
متن کاملStochastic Optimization for Rigid Point Set Registration
In this paper we propose a new method for pairwise rigid point set registration. We pay special attention to noise robustness, outlier resistance and global optimal alignment. The problem of registering two point clouds in space is converted to a minimization of a nonlinear cost function. We propose a cost function that aims to reduce the impact of noise and outliers. Its definition is based on...
متن کاملRobust Rigid Shape Registration Method Using a Level Set Formulation
This paper presents a fast algorithm for robust registration of shapes implicitly represented by signed distance functions(SDFs). The proposed algorithm aims to recover the transformation parameters(scaling, rotation, and translation) by minimizing the dissimilarity between two shapes. To achieve a robust and fast algorithm, linear orthogonal transformations are employed to minimize the dissimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLoS ONE
سال: 2014
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0091381